A latin game

ABSTRACT

It is disclosed a board game including patterned graph boards, sets of grouped index elements, and disparate successful arrangements. Each patterned graph board has graph patterns associated with several nodes of the same number for all the graph patterns. Two nodes of a given graph pattern are shared by two graph patterns. Each set of grouped index elements includes three or more groups, each having two or more identical index elements of certain numerical value unique to the each group. The disparate successful arrangements are successful arrangements that differ from each other by an arrangement result value, or by being a Latin arrangement, and by being associated with certain patterned graph board. The successful arrangement has an arrangement result value, the same for all graph patterns of a given patterned graph board under a given pattern operation. The pattern result value is the result of a pattern operation on a graph pattern, the operation may be addition of the numerical values of the index elements of a graph pattern. The Latin arrangement is an arrangement in which every index element disposed on a graph pattern of a given patterned graph board is disposed once and only once in any graph pattern.

CLAIM OF PRIORITY

This application claims the benefit of Israeli patent application Ser. No. 190579 filed 2008 Apr. 2 by the present inventor.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The invention is in the field of games. The invention is related to puzzle games, jigsaw games and mathematical recreation quizzes, and may be used in various computerized systems and as a board game in a box.

2. Description of Related Art

The concept of Latin arrangement is clearly defined in U.S. Pat. No. 3,189,350 to Hopkins. Using the example of an N×N square he defines every column and every row of the square as a pattern. In Latin arrangement a series of N symbols, such as Latin letters, are so arranged that no symbol occurs twice in any pattern.

Newspapers suggest a Sudoko challenge, in which a 9×9 square is partially filled with the numbers 1-9. One has to complete the 9×9 square by another numbers selected from the numbers 1-9, in order to obtain both a 9×9 Latin square arrangement over row and column patterns, and a Latin arrangement over each of nine 3×3 square patterns. Sometimes, several Sudoko challenges are being offered at a variety of skill levels to comply with the skill level of a variety of readers.

IL 179388 and PCT/IL07/01340 applications by the present inventor disclose games related to the present invention. These applications are incorporated herein by reference in their entirety and for all purposes.

IL 179388 and PCT/IL07/01340 applications describe a non-Latin arrangement as having at least one pattern with two appearances of the same symbol. The applications disclose a board game with a patterned graph board and a set of grouped index elements enabling a player to arrange the index elements in two arrangements, a Latin arrangement and a non-Latin arrangement. Hereafter, such a board game having at least one non-Latin arrangement and at least one Latin arrangement, is designated by Latin plus board game(LPG).

Rather than a stand alone game, LPGs have been previously suggested as a gift, wherein various numbers associated with a game have some significance to a person getting the gift, or to a company using the gift as a promotion, etc. For example, LPG having an arrangement result value of 13 is suggested as a gift for a boy having a 13^(th) birthday. As a game, an LPG with two possible arrangements can barely be a stand alone game as once one finds the two arrangements, there is no more challenge and interest in the game.

One object of the present invention is to disclose LPGs that have more content and possibilities and thus to enable LPGs' commercial use as stand alone games.

BRIEF SUMMARY OF THE INVENTION

It is disclosed, for the first time, a board game comprising one or more patterned graph boards, one or more sets of grouped index elements, and three or more disparate successful arrangements. Each patterned graph board has three or more graph patterns. Each of the three or more graph patterns are associated with a first number of three or more nodes. Two nodes of a given graph pattern are associated also with other graph pattern. The first number of three or more nodes is the same number for all graph patterns of a given patterned graph board.

Each set of grouped index elements is a set of three or more groups. Each group has two or more identical index elements. Each index element is associated with a numerical value unique to the each group. The index elements of each set of grouped index elements are suitable in shape and number to be disposed on all the nodes of at least one of the patterned graph board at an arrangement of one index element on each node.

The disparate successful arrangements are successful arrangements that differ from each other by an arrangement result value, or by being a Latin arrangement, or by being associated with certain patterned graph board. The successful arrangement is an arrangement having an arrangement result value. The arrangement result value is a pattern result value which is the same for all graph patterns of a given patterned graph board under a given pattern operation. The pattern result value is the result of a pattern operation on a graph pattern. The pattern operation is a mathematical operation on the numerical values associated with all the index elements of a graph pattern. The Latin arrangement is an arrangement in which every index element disposed on a graph pattern of a given patterned graph board is disposed once and only once in any graph pattern.

In some embodiments, the board game includes at least two patterned graph boards.

In some embodiments, the board game includes at least two sets of grouped index elements.

In some embodiments, the pattern operation is addition of the numerical values associated with the elements disposed on the graph pattern.

In some embodiments, the game board includes at least one set of grouped index elements having all the index elements thereof associated with numerical values of a single arithmetic series.

In some embodiments, the pattern operation is multiplication of numerical values associated with the elements disposed on the graph pattern.

In some embodiments, the board game includes at least one set of grouped index elements having all the index elements thereof associated with numerical values of a single geometric series.

In some embodiments, one of the patterned graph boards is a patterned star graph.

In some embodiments, the three or more disparate successful arrangements include at least one Latin arrangement.

In some embodiments, the three or more disparate successful arrangements include at least four disparate successful arrangements.

In some embodiments, the one or more sets of grouped index elements include at least one set of grouped colored index elements having unique color for each group.

In some embodiments, the one or more sets of grouped index elements include at least one set of grouped shaped index elements having unique shape for each group.

In some embodiments, the one or more patterned graph boards include a single patterned graph board, and the one or more sets of grouped index elements include a single set of grouped index elements.

In some embodiments, the game includes a first number of two or more identical patterned graph boards wherein teach player gets a board.

In some embodiments, the board game is a computer game.

It is disclosed for the first time, a method for a computerized board game that includes displaying patterned graph boards, displaying sets of grouped index elements, and allowing players to dispose index elements of the grouped index elements on the patterned graph boards for getting three or more disparate successful arrangements.

It is disclosed for the first time, a computer system for generating a computerized board game that includes a player interface and a game generator. The player interface is operative to receive features of a desirable board game from a computing device, and to export to the computing device an integrated board game generated in accordance with the features of a desirable board game.

The game generator is operative to determine parameters of a designed board game in accordance with the features of a desirable board game, design patterned graph boards in accordance with the parameters of a designed board game, design sets of grouped index elements in accordance with the parameters of a designed board game, and integrate a board game comprising the patterned graph boards and the sets of grouped index elements. The integrated board game has at least three disparate successful arrangements.

In some embodiments, the player interface is further operative to interact with the computing device while a player plays the integrated board game on the computing device.

It is disclosed, for the first time, a method for generating a computerized board game for a computing device. The method includes receiving features of a desirable board game, determining parameters of a designed board game in accordance with the features of a desirable board game, designing patterned graph boards in accordance with the parameters of a designed board game, designing sets of grouped index elements in accordance with the parameters of a designed board game, integrating a board game comprising the patterned graph boards and the sets of grouped index elements, and exporting the integrated board game to the computing device. The integrated board game has at least three disparate successful arrangements.

In some embodiments, the method further includes interacting with the computing device while a player plays the integrated board game on the computing device.

These and further embodiments will be apparent from the detailed description and examples that follow.

BRIEF DESCRIPTION OF THE DRAWINGS

The subject matter regarded as the invention is particularly pointed out and distinctly claimed in the concluding portion of the specification. The invention, however, both as to organization and method of operation, together with features and advantages thereof, may best be understood by reference to the following detailed description when read with the accompanied drawings in which:

FIG. 1 is a schematic drawing of a patterned star graph board.

FIG. 2 a is a schematic drawing of a patterned polygonal graph board topologically equivalent to a patterned star graph board.

FIG. 2 b is a schematic drawing of a patterned circular graph board topologically equivalent to a patterned star graph board.

FIG. 3 a shows a set of grouped index elements.

FIG. 3 b shows a Latin arrangement of index elements on a patterned graph board.

FIG. 3 c shows a non-Latin arrangement of index elements on a patterned graph board.

FIG. 4 a presents a table showing examples of indices associated with numerical values.

FIG. 4 b shows exemplary shaped index elements.

FIG. 4 c shows exemplary colored index elements.

FIG. 5 a shows a patterned star graph board with black triangular nodes.

FIG. 5 b shows a patterned tri-trapezoid graph board of order three having four nodes per graph pattern.

FIG. 5 c shows a patterned cross graph board of order four having four nodes per rectangular graph pattern.

FIGS. 6, 7 and 8 show a first embodiment of the present invention:

FIG. 6 a is a first patterned graph board.

FIG. 6 b is a second patterned graph board.

FIG. 6 c is a first set of grouped index elements.

FIG. 6 d is a second set of grouped index elements.

FIG. 7 a is a Latin arrangement of the first set of grouped index elements on the first patterned graph board.

FIG. 7 b is a non-Latin arrangement of the first set of grouped index elements on the first patterned graph board.

FIG. 8 a is a Latin arrangement of the second set of grouped index elements on the second patterned graph board.

FIG. 8 b is a first non-Latin arrangement of the second set of grouped index elements on the second patterned graph board.

FIG. 8 c is a second non-Latin arrangement of the second set of grouped index elements on the second patterned graph board.

FIG. 8 d is a third non-Latin arrangement of the second set of grouped index elements on the second patterned graph board.

FIG. 9 shows a second embodiment of the present invention:

FIG. 9 a is a single set of grouped index elements.

FIG. 9 b is a Latin arrangement of index elements on a first patterned graph board.

FIG. 9 c is a Latin arrangement of index elements on a second patterned graph board.

FIG. 9 d is a non-Latin arrangement of index elements on the second patterned graph board.

FIGS. 10, 11 and 12 show a third embodiment of the present invention, a two-party board game:

FIG. 10 shows two identical patterned graph board and a single set of grouped index elements.

FIG. 11 a is an exemplary first set of grouped index elements picked up by a first player.

FIG. 11 b is an exemplary second set of grouped index elements picked up by a second player.

FIG. 12 a shows four disparate successful arrangements by the first player.

FIG. 12 b shows three disparate successful arrangements by the second player.

FIG. 12 c presents an exemplary credit table for two parties.

FIG. 13 is a flow chart of a method for a computerized Latin plus board game.

FIG. 14 is a block diagram of a computerized Latin plus board game.

FIG. 15 is a flow chart of a method for generating a computerized Latin plus board game.

FIG. 16 is a block diagram of a system for generating a Latin plus board game.

FIG. 17 is a block diagram of a system for generating a Latin plus board game.

FIG. 18 is a block diagram of a computerized Latin plus board game played in interaction with a server.

DESCRIPTION OF PREFERRED EMBODIMENTS

The present invention will now be described in terms of specific example embodiments. It is to be understood that the invention is not limited to the example embodiments disclosed. It should also be understood that not every feature of the methods and systems handling the described Latin plus board game is necessary to implement the invention as claimed in any particular one of the appended claims. Various elements and features of devices are described to fully enable the invention. It should also be understood that throughout this disclosure, where a method is shown or described, the steps of the method may be performed in any order or simultaneously, unless it is clear from the context that one step depends on another being performed first.

Before explaining at least three embodiments of the invention in detail, it is to be understood that the invention is not limited in its application to the details of construction and the arrangement of the components set forth in the following description or illustrated in the drawings. The invention is capable of other embodiments or of being practiced or carried out in various ways. Also, it is to be understood that the phraseology and terminology employed herein is for the purpose of description and should not be regarded as limiting.

Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. The materials, methods, and examples provided herein are illustrative only and not intended to be limiting.

In the description and claims of the present application, each of the verbs “comprise”, “include” and “have”, and conjugates thereof, are used to indicate that the object or objects of the verb are not necessarily a complete listing of members, components, elements or parts of the subject or subjects of the verb.

Definitions and Examples

In this section, terms appear underlined where they are being defined. In general, patterned graph board is a graph board having a first number of graph patterns, each graph pattern being associated with a second number of nodes. The first number, the graph order, is three or more. The second number, the pattern size, is three or more and is the same number for all graph patterns. Each node is associated with one or two graph patterns. Every graph pattern shares exactly two nodes with two other patterns. Thus, every graph pattern has at least one node which is not associated with any other graph pattern.

Graph patterns of a patterned graph board are visually distinguished from each other by various ways, for example:

a) A straight line, unseen between nodes, is connecting all the nodes associated with a linear graph pattern. b) A closed geometric shape such as a trapezoid, a circle, a rectangle, or a triangle is connecting all the nodes of a graph pattern.

FIG. 1 a shows a patterned star graph board 400, which includes a plurality of connecting lines 410 and a plurality of nodes 415. A triangular graph pattern 430 is associated with three nodes, two of which are shared with the two neighboring patterns, while one node is associated only with a graph pattern 430. The graph order is four as there are four triangular patterns, and the pattern size is three as there are three nodes in each graph pattern.

FIG. 2 shows two patterned graph boards that are topologically equivalent to the patterned star graph board 400. FIG. 2 a presents a patterned polygonal graph board 450, wherein a linear graph pattern 455 is topologically equivalent to the triangular graph pattern 430. FIG. 2 b presents a patterned circular graph board 460, wherein circular graph pattern 465 is topologically equivalent to the triangular pattern 430 and to the linear pattern 455.

In general, a set of grouped index elements is a set of three or more groups, each group having two or more identical index elements. Each index element of a given group is associated with a numerical value, unique to the given group of that set.

FIG. 3 a shows exemplary set 417 of grouped index element, each associated with a numerical value, which equals the number of domino-like dots in the index element. Thus, index elements 420-1, 420-2 and 420-3 are associated with numerical values of 1,2 and 3 respectively. The number of identical index elements in each group is three, three and two, respectively, for the first, second and third row groups.

In general, an arrangement is a disposition of index elements of a set of grouped index elements on the nodes of a patterned graph board, a single element on each node. Thus, a set of index elements may have an arrangement over a patterned graph board if the number of index elements of the set is equal or greater than the number of nodes in the patterned graph board. If the number of index elements exceeds the number of nodes by a certain number, the number of index elements of the set that are not disposed on the patterned graph board is the certain number.

A Latin arrangement is an arrangement in which every index element disposed on a graph pattern of a given patterned graph board is disposed once and only once in any graph pattern of the given patterned graph board. In other words, a whole group of the set of grouped index elements is either absent from all graph patterns or has a single element of the group in each graph pattern.

FIG. 3 b presents arrangement L440-6 of the index elements of set 417 on patterned graph board 400 such that a single element is disposed on each node of patterned graph board 400. Each of the elements 420-1, 420-2, and 420-3 is disposed once and only once on each graph pattern. Therefore, arrangement L440-6 is a Latin arrangement.

In general, a non-Latin arrangement is an arrangement that is not a Latin arrangement. Latinicity is a descriptor of an arrangement that has a TRUE value for a Latin arrangement, and a FALSE value for a non-Latin arrangement.

Arrangement L440-6 has a TRUE Latinicity value. FIG. 3 c shows arrangement N440-5 of the index elements of set 417 on patterned graph board 400. Two identical elements 420-2 are disposed on triangular graph pattern 430. Therefore, arrangement N440-5 is a non-Latin arrangement having a FALSE Latinicity value.

In general, pattern operation is a mathematical operation on the numerical values associated with all the index elements of a graph pattern. The result of a pattern operation is a pattern result value. For example, for addition pattern operation, the pattern result value is the sum of the numerical values associated with all the index elements of the graph pattern. As another example, the pattern result value under multiplication pattern operation is the product of the numerical values associated with all the index elements of the graph pattern.

If all the graph patterns have the same pattern result value under a given pattern operation, the arrangement is a successful arrangement, and the common pattern result value is the arrangement result value.

Note that a Latin arrangement is a successful arrangement under both addition pattern operation and multiplication pattern operation. However, the arrangement result value is usually not the same under addition pattern operation and under multiplication pattern operation. In contrast, non-Latin arrangement is not necessarily a successful arrangement. Actually, finding successful non-Latin arrangements is a challenge suggested to players of the present Latin plus games.

Like all Latin arrangements, arrangement L440-6 is an example of a successful arrangement. Under the addition pattern operation, the same pattern result value of six is obtained for all graph patterns of patterned graph board 400. Non-Latin arrangement N440-5 is also a successful arrangement as it has the same pattern result value of five for all graph patterns of patterned graph board 400.

In general, disparate successful arrangements are successful arrangements that differ appreciably from each other as follows. Two successful arrangement are disparate if they are associated with different patterned graph boards. Two successful arrangement that are associated with the same patterned graph boards are disparate if they differ from each other by at least one of Latinicity and arrangement result value.

Arrangements L440-6 and N440-5 are disparate successful arrangements as they differ from each other by both Latinicity and arrangement result value.

In general, similar successful arrangements are successful arrangements of the same patterned graph board under the same pattern operation that have the same Latinicity and the same arrangement result value. Similar arrangement are not necessarily identical arrangements, as an arrangement may be changed by certain permutations but still preserves its Latinicity and its arrangement result value. For example, in a patterned graph board having a pattern size of four, two different elements may be associated with only one pattern. Permutation of these two elements changes neither Latinicity nor arrangement result value.

FIG. 4 illustrates exemplary index types, element shapes, and element colors. The four first rows of the table of FIG. 4 a show the numbers 3 and 5 associated with four index types: a domino-like set of dots, regular Arabic numerals, Roman numbers, and Hebrew letters that have numerological equivalent values. The last column shows the result of addition operation on the numbers 3 and 5 for the four index types. The last row shows a multiplication operation on the numbers 8 and 32 with the resulting product of the number 256. As 8=2³, 32=2⁵, 256=2⁸, the last row is a power mapping of the first four rows.

FIG. 4 b shows exemplary element shapes, an hexagon 500, a cross 510, a cube 520 and a cylinder 530. FIG. 4 c presents exemplary colored index elements, a red colored element R540-1, a green colored element G540-3 and a blue colored element B540-5, wherein vertical, diagonal and horizontal lines designate the red, green and blue colors, respectively.

FIG. 5 illustrates, for an example only, three patterned star graph boards. FIG. 5 a show an hexagram 550 with a graph pattern 555, wherein the nodes are designated by black triangles, the graph order is six and the pattern size is three. FIG. 5 b shows a patterned tri-trapezoid graph board 560 having three graph patterns, graph pattern 565 for example, with a pattern size of four, and with two shared nodes and two non-shared nodes per graph pattern. FIG. 5 c shows a patterned cross graph board 570 with rectangular graph pattern 575 of size four.

FIGS. 1 and 3 illustrate a Latin plus board game having one patterned graph board, one set of grouped index elements and two disparate successful arrangements. The three preferred embodiments described below are of a Latin plus games having at least three disparate successful arrangements.

First Preferred Embodiment (FIGS. 6-8)

The first preferred embodiment is Latin plus board game, which may be implemented as a box game. The game includes two patterned graph boards 560 and 600, and two respective sets of grouped index elements, 605 and 615. Set 605 includes three white elements W610-1, associated with a numerical value of one, three red elements R610-2, associated with a numerical value of two, and two green elements G610-3, associated with a numerical value of three. Set 615 includes two, two, three and two respective elements 620-2, 620-3, 620-4, and 620-5, associated respectively with numerical values of two, three, four and five. The numerical value series, 1,2,3 of set 605 is an arithmetic series, as is also the numerical value series 2,3,4,5 of set 615.

The game may have rules that call the player to dispose the index elements of sets 605 and 615 on patterned graph boards 560 and 600, respectively, in order to get as many disparate successful arrangements as possible, under the addition pattern operation. A single player may start with set 605 and board 560, get acquainted with the reasoning required to overcome the challenge, and then tries to overcome the second challenge of disposing set 615 on board 600, whereas the challenge would be easier due to his acquaintance with the required reasoning.

The game may also serve two players, one taking set 605 and board 560, the other taking set 615 and board 600. The two players may play simultaneously, cooperating and competing as desired, and may replace sets and boards in a consequent playing phase.

FIG. 7 shows two disparate successful arrangements L640-6 and N640-5 of set 605 on board 560, that are disparate from each other due to both different Latinicity and different arrangement result value.

FIG. 8 shows four disparate successful arrangements of set 615 on board 600. Arrangement L630-14 is a Latin arrangement, being disparate from non-Latin arrangements N630-13, N630-14 and N630-15. Arrangements N630-13, N630-14 and N630-15 are disparate arrangement as they each have a different arrangement result value. In total, the Latin plus box game of FIGS. 6-8 has six disparate successful arrangements.

In some embodiments, patterned graph boards of order five to eight may be used.

In some embodiments, patterned circular or linear graph boards may be used.

In some embodiments, the game may be implemented as a computerized game for a personal computer, a cellular phone, a personal digital assistant or portable media player.

Second Embodiment (FIG. 9)

The second embodiment is a Latin plus game that includes single set 645 of grouped index elements of FIG. 9 a, and two patterned graph boards 560 and 600 of FIGS. 6 a and 6 b, respectively. The pattern operation is multiplication, and correspondingly the numerical values associated with index elements 650-2, 650-4, 650-8 and 650-16 are the respective members 2,4,8 and 16 of a geometrical series. The game may have rules that call the player to dispose index elements of set 645 on boards 560 and 600, achieving as many as possible disparate successful arrangements under multiplication pattern operation.

FIG. 9 b shows Latin arrangement L660-64 of set 645 on board 560, wherein the arrangement result value is 64, and two index elements 650-16 of set 645 are left outside arrangement L660-64.

FIG. 9 c shows Latin arrangement L670-1024 of set 645 on board 600, wherein the arrangement result value is 1024, and one index element 650-8 of set 645 is left outside arrangement L670-1024.

FIG. 9 d shows non-Latin arrangement N680-512 of set 645 on board 600, wherein the arrangement result value is 512, and one index element 650-4 of set 645 is left outside arrangement N680-512. Thus, the Latin plus game board of the second embodiment has at least three disparate successful arrangements.

In some embodiments, patterned graph boards of order five to eight may be used as at least one of the patterned graph boards.

In some embodiments, the game may be a computerized game for a personal computer, a cellular phone, a personal digital assistant, portable media player or another computerized device.

Third Embodiment (FIGS. 10-12)

The third embodiment is a two-party Latin plus board game, preferably a box game. More preferably, the game is a computer game operated by an internet site. In some embodiments, the two parties may decide to bet on getting better results and the internet site operator cuts a share of the winner.

As shown in FIG. 10, each of the two parties gets board 570. Set 700 of grouped index elements 420-1,420-2, 420-3 and 420-4 constitutes a stock common to both parties. A die is being thrown to decide on the first player to pick up an index element from the common stock, and then each player picks up an additional index element in his turn. Once all the index elements have been picked up, every player tries to get as many as possible disparate successful arrangements on board 570 using the index elements he have selected.

The division of the common stock 700 between players may disable any successful arrangements. Also, even in the case that successful arrangements are possible, an inexperienced player may get no successful arrangement. For such cases, the game may include a rule awarding a credit for graph patterns having the same pattern result value even if not all the graph patterns have the same pattern result value. For example, in the case of pattern result values of 10,10, 9 and 11, the credit granted may be 2 points, the number of identical pattern result values. With such a rule, the player may not get additional credit for another arrangement with the same pattern result value of 10, but he may still get an additional credit for another arrangement with a different pattern result value. For example, the player may get a credit of 3 points for an arrangement with three pattern result values of 11.

For a successful arrangement, a game rule may award a credit of 8 points, twice the number of equal pattern result values. Two disparate successful arrangements may get a credit of 8 points each, and a total credit of 16 points. In contrast, two similar successful arrangements, even though they are not identical ones, are granted a credit of only 8 points.

In some embodiments, once a credit is granted for one successful arrangement, no credit can be given to unsuccessful arrangements. Such a rule enhances focusing on achievement of additional disparate successful arrangements.

The number of elements in the groups of exemplary set 700 have been chosen in such a way that two experienced players may share the common stock of index elements and both have a set of grouped index elements enabling disparate successful arrangements. In the example of FIGS. 11-12, one player gets set 700-4233 with four elements 420-1, two elements 420-2, three elements 420-3 and three elements 420-4, as illustrated in FIG. 11 a. Similarly, the second player gets set 700-3432. FIG. 12 a shows four disparate arrangements L710-10, N710-9, N710-10 and N710-11 that the first player may obtain, getting a credit of 4×8=32 points. Having set 700-3432, the second player may obtain only three disparate successful arrangements L720-10, N720-10 and N720-9 of FIG. 12 b, gets a credit of 3×8=24 points and losing the game to the first player.

In some embodiments, the game includes a credit table that facilitates credit calculations, as exemplified in FIG. 12 c for the arrangement of FIGS. 12 a and 12 b.

There are several sets of grouped index elements, hereafter fair chance sets, that support equal number of possible disparate successful arrangements for both parties. There are several sets, hereafter biased chance sets, which give an advantage to the first player to be lucky enough to be the first player picking up an index element. In a computerized game, the set of grouped index elements may be selected randomly from a combined list that include both fair chance sets and biased chance sets. In the case that a biased chance set have been selected, the first player to pick up an index element has an advantage over the second player.

In some embodiments, each player gets an identical patterned graph board and identical set of grouped index elements, such that both parties have exactly the same chance to win, and good luck plays no rule. The game may include a rule that the winner is the player who gets more credit within a predetermined time frame. Also, the players may be advised to obtain high skill level as a single player of Latin plus games before playing a two-party game.

Computerized Embodiments (FIGS. 13-18)

FIG. 13 is a flow chart of a method 750 for a computerized Latin plus board game. The game includes three steps. The first step is displaying 755 one or more patterned graph boards on a computing device. The second step is displaying 760 one or more sets of grouped index elements on the computing device. The third step is allowing 765 one or more players to dispose index elements of the one or more sets of grouped index elements on the one or more patterned graph boards, getting three or more disparate successful arrangements.

In some embodiments, some of the steps of method 750 may be carried simultaneously, or carried in order different from the step order in the preceding paragraph. Also, several steps may be repeated two times or more. For example, one patterned graph board may be displayed 755 simultaneously with display 760 of one set of grouped index elements. After the player achieves 765 two disparate successful arrangements, he may choose to continue playing and the computerized game will display another patterned graph board as well as another set of grouped elements, allowing 765 the player to achieve additional two disparate successful arrangements. Eventually, the total number of disparate successful arrangements exceeds three.

A Latin plus game 780 in a computing device is described in the block diagram of FIG. 14. The game includes one or more patterned graph boards 782, one or more sets 784 of grouped index elements, and player interface 788. The player interface 788 allows the player to dispose index elements of the sets 784 of grouped index elements on the patterned graph boards 782, and thus to get at least three disparate successful arrangements.

In some embodiments, a pattern result value may be displayed inside all closed graph pattern or near all linear graph pattern, saving the somewhat tedious calculations required to obtain a successful arrangement.

It is disclosed, as shown in the flow chart of FIG. 15, a method 790 for generating a computerized Latin plus board game for a computing device. The method includes the steps of receiving 791 features of a desirable board game, determining 792 parameters of a designed board game in accordance with the features of a desirable board game, designing 793 patterned graph boards in accordance with the parameters of a designed board game, designing 794 one or more sets of grouped index elements in accordance with the parameters, integrating 795 a board game having at least three disparate successful arrangements, and exporting 796 the integrated game to a computing device.

The game features received 791 may include desirable skill level and a number of patterned graph boards. Accordingly, the game parameters determined 792 may include the graph order, the pattern size, the range of numerical values associated with the index elements, etc.

FIG. 16 is a block diagram of a computer system 800 for generating a computerized Latin plus board game. System 800 includes a player interface 810 and a game generator 840. Player interface 810 is operative to receive features of a desirable board game from a computing device, and export to the computing device an integrated board game generated in accordance with the features of a desirable board game.

Game generator 840 is operative to determine parameters of a designed board game in accordance with the features of a desirable board game, design patterned graph boards in accordance with the parameters of a designed board game, design one or more sets of grouped index elements in accordance with the parameters of a designed board game, and integrate a board game including the one or more patterned graph boards and the o sets of grouped index elements.

The integrated board game has at least three disparate successful arrangements of index elements of the sets of grouped index elements on the patterned graph boards.

In some embodiments, player interface 810 includes a game feature receiver 820 and a game export unit 830.

In some embodiments, game generator 840 includes a game parameter unit 850, a board design unit 860, a board elemental design unit 900 and a game integrator 950. Board design unit 860 contains a library 870 of board layouts and a library 880 of node shape/color. Elemental design unit 900 includes a library 910 of symbol/font and a library 920 of shape/color.

Game feature receiver 820 interacts with the computing device, receiving for example features of a desirable board game, desirable skill level and a number of patterned graph boards. Accordingly, game parameter unit 850 determines parameters of the game. For example, it may determine the graph order, the pattern size, the range of numerical values associated with the index elements, etc. Board design unit 860 loads board layout and node features from libraries 870 and 880, respectively, in accordance with the determined parameters. Elemental design unit 900 loads symbol or fonts from library 910, and picks up shape/color of the index elements from library 920. Finally, game integrator 950 integrates all the loaded items into an integrated game, and game export unit 830 export the integrated game to the computing device.

In some embodiments, illustrated in the block diagram of FIG. 17, the system for generating a Latin plus game is a server system 970 that interacts online with a client computing device. Thus, server system 970 includes a player interface 971, that is operative to interact with a client computing device in accordance with a played board game in the computing device. In one embodiment, the player interface includes a game interaction unit 974 to facilitate such an interaction.

In some embodiments, illustrated in the block diagram of FIG. 18, an interacting client computing device has a Latin plus game system that includes one or more sets 784 of grouped index elements, patterned graph boards 782, and a player interface 968. The player interface 968 allows the player to dispose index elements of the sets of grouped index elements on the one or more patterned graph boards, and thus to get at least three disparate successful arrangements. Player interface 968 supports an interaction of the client computing device with the server during a play with the imported game. Thus, two players having each a computing device may play with each other using server 970 as a mediator. For example only, the two parties may play the two-party game of the third embodiment.

In some embodiments, the server exports 796 a Latin plus game to the client computing device, and after the player terminates an interactive play, the player starts another cycle of delivering desirable game features, getting a new Latin plus game, and playing it interactively with the server.

Although the invention has been described in conjunction with specific embodiments thereof, it is evident that many alternatives, modifications and variations will be apparent to those skilled in the art. Accordingly, it is intended to embrace all such alternatives, modifications and variations that fall within the spirit and broad scope of the appended claims. 

1. A board game comprising: a) one or more patterned graph boards, each patterned graph board having three or more graph patterns, each of said three or more graph patterns being associated with a first number of three or more nodes, two nodes of said three or more nodes of a given graph pattern being associated each with other graph pattern, said first number of three or more nodes being the same number for all graph patterns of a given patterned graph board of said one or more patterned graph boards; b) one or more sets of grouped index elements, each set of grouped index elements being a set of three or more groups, each group having two or more identical index elements, each index element being associated with a numerical value unique to said each group, the index elements of each set of grouped index elements being suitable in shape and number to be disposed on all the nodes of at least one of said one or more patterned graph boards at an arrangement of one index element on each node thereof; and c) three or more disparate successful arrangements, said disparate successful arrangements being successful arrangements that differ from each other by at least one of an arrangement result value, being a Latin arrangement, and being associated with certain patterned graph board; wherein said successful arrangement being an arrangement having an arrangement result value, said arrangement result value being a pattern result value which is the same for all graph patterns of a given patterned graph board under a given pattern operation, said pattern result value being the result of a pattern operation on a graph pattern, said pattern operation being a mathematical operation on the numerical values associated with all the index elements of a graph pattern, said Latin arrangement being an arrangement in which every index element disposed on a graph pattern of a given patterned graph board being disposed once and only once in any graph pattern of said given patterned graph board.
 2. The board game of claim 1 wherein the game includes at least two patterned graph boards.
 3. The board game of claim 1 wherein the game includes at least two sets of grouped index elements.
 4. The board game of claim 1 wherein said pattern operation is addition of the numerical values associated with the elements disposed on the graph pattern.
 5. The board game of claim 1 wherein all the index elements of at least one set of grouped index elements are associated with numerical values of a single arithmetic series.
 6. The board game of claim 1 wherein said pattern operation performed on a graph pattern is multiplication of numerical values associated with the elements disposed on the graph pattern.
 7. The board game of claim 1 wherein all the index elements of at least one set of grouped index elements are associated with numerical values of a single geometric series.
 8. The board game of claim 1 wherein one of the patterned graph boards is a patterned star graph.
 9. The board game of claim 1 wherein the game includes at least one Latin arrangement.
 10. The board game of claim 1 wherein the game includes at least four disparate successful arrangements.
 11. The board game of claim 1 wherein each group of at least one set of grouped colored index elements has unique color not shared with other group of the set.
 12. The board game of claim 1 wherein each group of at least one set of grouped colored index elements has unique shape not shared with other group of the set.
 13. The board game of claim 1 wherein the game includes a single patterned graph board, and a single set of grouped index elements.
 14. The board game of claim 1 wherein the one or more patterned graph boards include a first number of two or more identical patterned graph board wherein the board game is a game for a first number of parties.
 15. The board game of claim 1 wherein the board game is a computer game.
 16. A method for a computerized board game comprising: a) displaying one or more patterned graph boards, each patterned graph board having three or more graph patterns, each of said three or more graph patterns being associated with a first number of three or more nodes, two nodes of the three or more nodes of a given graph pattern being associated each with other graph pattern, said first number of three or more nodes being the same number for all graph patterns of a given patterned graph board of said one or more patterned graph boards; b) displaying one or more sets of grouped index elements, each set of grouped index elements being a set of three or more groups, each group having two or more identical index elements, each index element being associated with a numerical value unique to said each group, the index elements of each set of grouped index elements being suitable in shape and number to be disposed on all the nodes of at least one of said one or more patterned graph boards at an arrangement of one index element on each node thereof; and c) allowing one or more players to dispose index elements of said one or more sets of grouped index elements on said one or more patterned graph boards, getting three or more disparate successful arrangements, said disparate successful arrangements being successful arrangements thereof that differ from each other by at least one of an arrangement result value, being a Latin arrangement, and being associated with certain patterned graph board.
 17. A computer system for generating a computerized board game comprising: a) a player interface operative to: i) receive features of a desirable board game from a computing device; and ii) export to said computing device an integrated board game generated in accordance with said features of a desirable board game; and b) a game generator operative to: A) determine parameters of a designed board game in accordance with said features of a desirable board game; B) design one or more patterned graph boards in accordance with said parameters of a designed board game, each patterned graph board having three or more graph patterns, each of said three or more graph patterns being associated with a first number of three or more nodes, two nodes of the three or more nodes of a given graph pattern being associated each with other graph pattern, said first number of three or more nodes being the same number for all graph patterns of a given patterned graph board of said one or more patterned graph boar; C) design one or more sets of grouped index elements in accordance with said parameters of a designed board game, each set of grouped index elements being a set of three or more groups, each group having two or more identical index elements, each index element being associated with a numerical value unique to said each group, the index elements of each set of grouped index elements being suitable in shape and number to be disposed on all the nodes of at least one of said one or more patterned graph boards at an arrangement of one index element being disposed on each node thereof; and D) integrate a board game comprising said one or more patterned graph boards and said one or more sets of grouped index elements, the integrated board game having at least three disparate successful arrangements, said disparate successful arrangements being successful arrangements thereof that differ from each other by at least one of an arrangement result value, being a Latin arrangement, and being associated with certain patterned graph board.
 18. The computer system of claim 17 wherein the player interface is further operative to interact with said computing device while a player plays the integrated board game on said computing device.
 19. A method for generating a computerized board game for a computing device, the method comprising: i) receiving features of a desirable board game; ii) determining parameters of a designed board game in accordance with said features of a desirable board game; iii) designing one or more patterned graph boards in accordance with said parameters of a designed board game, each patterned graph board having three or more graph patterns, each of said three or more graph patterns being associated with a first number of three or more nodes, two nodes of the three or more nodes of a given graph pattern being associated each with other graph pattern, said first number of three or more nodes being the same number for all graph patterns of a given patterned graph board of said one or more patterned graph boar; iv) designing one or more sets of grouped index elements in accordance with said parameters of a designed board game, each set of grouped index elements being a set of three or more groups, each group having two or more identical index elements, each index element being associated with a numerical value unique to said each group, the index elements of each set of grouped index elements being suitable in shape and number to be disposed on all the nodes of at least one of said one or more patterned graph boards at an arrangement of one index element on each node thereof; v) integrating a board game comprising said one or more patterned graph boards and said one or more sets of grouped index elements, the integrated board game having at least three disparate successful arrangements, said disparate successful arrangements being successful arrangements thereof that differ from each other by at least one of an arrangement result value, being a Latin arrangement, and being associated with certain patterned graph board; and vi) exporting said integrated board game to said computing device.
 20. The method of claim 19 further comprising interacting with said computing device while a player plays the integrated board game on said computing device. 